Computational indistinguishability
IN COMPUTER SCIENCE, RELATIONSHIP BETWEEN TWO FAMILIES OF DISTRIBUTIONS
Computationally indistinguishable; Polynomial-time indistinguishable; Polynomial-time indistinguishability; Indistinguishability by polynomial-time sampling
In computational complexity and cryptography, two families of distributions are computationally indistinguishable if no efficient algorithm can tell the difference between them except with negligible probability.